Revisiting Brauer’s formula for tensor product decompositions
ثبت نشده
چکیده
The notation used here will be explained below. A familiar (though oversimplified) example is given for the Lie algebra sl2(C) by the Clebsch– Gordan formula; as in [2, Exer. 22.7]. In 1937 Richard Brauer published a short note giving a general formula of this sort. It still serves as the starting point for some computer methods, even though it usually involves a large number of cancellations. Here our purpose is to revisit Brauer’s formula and related matters from the perspective of the BGG (Bernstein-Gelfand-Gelfand) category O attached to a semisimple Lie algebra g over an algebraically closed field (or other splitting field) of characteristic 0. These ideas from the early 1970s provide new insights into the finite dimensional Cartan–Weyl theory by working also with certain infinite dimensional modules (see [3] for a recent account). Our approach was suggested by J.C. Jantzen. He, along with Allen Knutson and Shrawan Kumar, also provided valuable comments on an early version of this note. It is difficult to say what might constitute the “simplest” or most transparent proof of Brauer’s formula, since by now the tensor product decomposition has been studied using many tools ranging from Lie algebra theory to algebraic geometry and combinatorics. Only a few references are included below. Apparently Brauer’s formula depends essentially on the Weyl character formula, but first we discuss some more elementary steps leading to qualitative estimates about the possible summands in the decomposition (∗).
منابع مشابه
On Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملEntanglement and tensor product decomposition for two
The problem of the choice of tensor product decomposition in a system of two fermions with the help of Bogoliubov transformations of creation and annihilation operators is discussed. The set of physical states of the composite system is restricted by the superselection rule forbidding the superposition of fermions and bosons. It is shown that the Wootters concurrence is not the proper entanglem...
متن کاملExpansions for the Bollobás-riordan Polynomial of Separable Ribbon Graphs
We define 2-decompositions of ribbon graphs, which generalise 2-sums and tensor products of graphs. We give formulae for the Bollobás-Riordan polynomial of such a 2-decomposition, and derive the classical Brylawski formula for the Tutte polynomial of a tensor product as a (very) special case. This study was initially motivated from knot theory, and we include an application of our formulae to m...
متن کاملAtomic decompositions for tensor products and polynomial spaces
We study the existence of atomic decompositions for tensor products of Banach spaces and spaces of homogeneous polynomials. If a Banach space X admits an atomic decomposition of a certain kind, we show that the symmetrized tensor product of the elements of the atomic decomposition provides an atomic decomposition for the symmetric tensor product ⊗n s,μX, for any symmetric tensor norm μ. In addi...
متن کاملDeveloping Tensor Operations with an Underlying Group Structure
Tensor computations frequently involve factoring or decomposing a tensor into a sum of rank-1 tensors (CANDECOMP-PARAFAC, HOSVD, etc.). These decompositions are often considered as different higher-order extensions of the matrix SVD. The HOSVD can be described using the n-mode product, which describes multiplication between a higher-order tensor and a matrix. Generalizing this multiplication le...
متن کامل